New superbridge index calculations from non-minimal realizations

Previous work used polygonal realizations of knots to reduce the problem computing superbridge number a realization linear programming problem, leading new sharp upper bounds on index knots. The present extends this technique with an odd edges and determines exact many knots, including majority 9-crossing for which it was previously unknown and, first time, several 12-crossing Interestingly, at least half these superbridge-minimizing do not minimize stick knot; seem be such examples. Appendix A gives complete summary what is currently known about indices prime through 10 crossings B all 16 known.